|
The fair pie-cutting problem is a variation of the fair cake-cutting problem, in which the resource to be divided is circular. As an example, consider a birthday cake shaped as a disk. The cake should be divided among several children such that no child envies another child (as in a standard cake-cutting problem), with the additional constraint that the cuts must be radial, so that each child receives a circular sector. A possible application of the pie model might be for dividing an island’s shoreline into connected lots. Another possible application is in division of periodic time, such as dividing a daily cycle into "on-call" periods. == Model == A pie is usually modeled as the 1-dimensional interval () (or ()), in which the two endpoints are identified. This model was introduced in 1985 and later in 1993. Every procedure for fair cake-cutting can also be applied to cutting a pie by just ignoring the fact that the two endpoints are identified. For example, if the cake-cutting procedure yielded a division in which Alice receives () and the George receives (), then we would give Alice a circular sector of 120 degrees and George the remaining sector with 240 degrees. Pie cutting becomes more interesting when we consider questions of efficiency, since in pie-cutting more divisions are possible. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Fair pie-cutting」の詳細全文を読む スポンサード リンク
|